Computational complexity of computing a partial solution for the Graph Automorphism problems

The Complexity of Modular Graph Automorphism

Motivated by the question of the relative complexities of the Graph Isomorphism and the Graph Automorphism problems we de ne and study the modular graph automor phism problems These are the decision problems modk GA which consist for each k of deciding whether the number of automorphisms of a graph is divisible by k The modk GA problems all turn out to be intermediate in di culty between Graph ...

On the Computational Complexity of Dynamic Graph Problems

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh A common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case analysis and to express the cost of the computation as a function of the size of the input. However, for an incremental algorithm this kind of analysis is sometimes not very informative. (By an “incremental algorithm...

On the computational complexity of partial word automata problems

We consider computational complexity of problems related to partial word automata. Roughly speaking, a partial word is a word in which some positions are unspecified, and a partial word automaton is a finite automaton that accepts a partial word language— here the unspecified positions in the word are represented by a “hole” symbol ⋄. A partial word language L can be transformed into an ordinar...

The Computational Complexity of Asymptotic Problems I: Partial Orders

Algorithms for computing the Automorphism Group of a Graph and Sub Graph Isomorphism

In this report we present a brief survey of the existing algorithms for Computing the Automorphism Group of a graph, algorithms to compute Sub Graph Isomorphism(SGI) and also present some important results on Spectrum of a Graph. Graph Isomorphism(GI) has been a great interest of computer scientists the problem of SGI has been proved to be a NP-Complete problem however the complexity class of G...